|New method of solution of the traveling salesman problem (Volume Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 201) - Davidson, Edward S|
"March 23, 1966."
Keywords: Traveling salesman problem
|Optimum branchings (Volume 71B) - Edmonds, Jack|
Journal of Research of the National Bureau of Standards
Keywords: Algorithms; arborescences; branchings; combinatorics; graphs; linear programming; traveling salesman; trees
|Shared Crossover Method for Solving Traveling Salesman Problem - Mouhammd Al kasassbeh, Ahmad Alabadleh, Tahsen Al-Ramadeen|
Genetic algorithms (GA) are evolutionary techniques that used crossover and mutation operators to solveoptimization problems using a survival of the fittest idea. They have been used successfully in a variety of different problems,including the traveling salesman problem. The main idea of Traveling Salesman Problem (TSP) is to find the minimum travelingcost for visiting cities; which means that the salesman must visit each city exactly once and return to the starting point of origin.Genetic algo...
Keywords: Traveling Salesman Problem (TSP); Genetic Algorithm (GA); Order Crossover (OX); Swap Crossover; Shared Crossover
|Sunbeams - George Wilbur Peck|
LibriVox recording of Sunbeams by George Wilbur Peck. Read by Arnold Banner and Melora Campbell. George W. Peck was at times a writer, newspaper publisher and politician. Many of the Sunbeam essays had been published in Peck's paper, "The Sun", as amusing and often critical comments on social and political subjects, typically current in the beginning of the 1900's. Topics are often 'small town' United States, and Peck's gentle sarcasm or portrayals much resembles that of Twain.Listeners must be ...
Keywords: librivox; audiobook; essay; sarcassm; Admiral Dewey; drummer; traveling salesman; trust; bimetallic; horsemeat
|Space station heavy lift launch vehicle utilization - Deryder, L. J|
The use of Heavy Lift Launch Vehicles (HLLVs) for Space Station assembly, logistics. and resupply is explored. Potential HLLVs, including those based on the Titan, and Shuttle-derived vehicles (SDV), are discussed. The baseline Critical Evaluation Task Force (CETF) Space Station assembly sequence is described and compared with assembly options made possible through the use of HLLVs. The issues of cost, dual compatibility with the Space Shuttle Space Transportation System (STS), co-manifesting of...
Keywords: AUTONOMOUS NAVIGATION; TRAJECTORY ANALYSIS; TRAJECTORY PLANNING; TRAVELING SALESMAN PROBLEM; MISSION PLANNING; NAVIGATION; REMOTELY PILOTED VEHICLES; SEARCHING; ALGORITHMS; ARTIFICIAL INTELLIGENCE; EXPERT SYSTEMS; TERRAIN ANALYSIS
|mit :: lcs :: tr :: MIT-LCS-TR-479|
From the bitsavers.org collection, a scanned-in computer-related document.mit :: lcs :: tr :: MIT-LCS-TR-479
Keywords: heuristic; node; subtour; optimal; edges; theorem; tsp; asymmetric; symmetric; nodes; linear program; asymmetric subtour; triangle inequality; asymmetric case; symmetric case; adjusted cost; subtour elimination; traveling salesman; optimal solution; elimination constraints
|BSTJ 44: 10. December 1965: Computer Solutions of the Traveling Salesman Problem. (Lin, Shen)|
Bell System Technical Journal, 44: 10. December 1965 pp 2245-2269. Computer Solutions of the Traveling Salesman Problem. (Lin, Shen)
Keywords: optimal; tour; tours; traveling; cities; links; problem; computation; locally; reduction; optimal solutions; total computation; locally optimal; optimal solution; traveling salesman; optimal tour; bell system; salesman problem; computation time; system technical
|Innovative Computing Methods and Their Applications to Engineering Problems - Nadia Nedjah, Leandro dos Santos Coelho, Viviana Cocco Mariani, Luiza de Macedo Mourelle|
Innovative Computing Methods and Their Applications to Engineering Problems
Keywords: chaotic; optimization; algorithm; search; neural; reliability; fuzzy; function; methods; based; wind turbine; neural network; local search; chaotic search; objective function; failure time; chaotic neural; chaotic neuron; traveling salesman; optimization problems
|Fantastic Universe v11n03 - 1959 - King-Size|
Fantastic Universe v11n03 - 1959 - King-Size
Keywords: hawley; meekle; armstrong; universe; fantastic; luanne; rose; miranda; talix; fantastic universe; time dimension; rose tree; science fiction; blue eyes; amnesic men; wistful witch; traveling salesman; song bushes; royal jelly
|mit :: ai :: aim :: AITR-1569|
From the bitsavers.org collection, a scanned-in computer-related document.mit :: ai :: aim :: AITR-1569
Keywords: algorithm; optimization; maxima; genetic; procedure; algorithms; local; step; search; function; traveling salesman; image guided; local maxima; objective function; genetic algorithm; simulated annealing; energy minimization; step sizes; step size; high number
|BASIC Exercises for the Atari (1983)(Sybex)|
Keywords: print; program; figure; flowchart; atari; basic; data; exercises; basic exercises; goto; prime numbers; conceptual flowchart; taxable income; critical path; data processing; traveling salesman; involving data; exercises involving; telephone directory